منابع مشابه
The limit set intersection theorem for finitely generated Kleinian groups
The proof of the Theorem proceeds by showing that it holds in some special cases involving Kleinian groups with connected limit sets, and then extending to the general case by using a decomposition argument based on the Klein-Maskit combination theorems and a careful tracking of the limit points resulting from this decomposition. We discuss various well-behaved classes of limit points in Sectio...
متن کاملThe Complete Nontrivial-Intersection Theorem for Systems of Finite Sets
The theorem presented and proved in this paper can be viewed as an extension or improvement of our recent Complete Intersection Theorem [1] and may be called the Complete Nontrivial-Intersection Theorem. It goes considerably beyond the well-known Hilton Milner Theorem [10]. We put the result into the proper perspective with a brief sketch of the key steps in its development, beginning with the ...
متن کاملAn intersection theorem for systems of finite sets
For nonnegative reals ω, ψ and natural t ≤ k ≤ (n + t − 1)/2, the maximum of ω A ∩ [n] k + ψ A ∩ [n] n + t − 1 − k among all t-intersecting set systems A ⊆ 2[n] is determined. © 2015 Elsevier B.V. All rights reserved.
متن کاملThe Complete Intersection Theorem for Systems of Finite Sets
We are concerned here with one of the oldest problems in combinatorial extremal theory. It is readily described after we have made a few conventions. ގ denotes the set of
متن کاملExtension of Krull's intersection theorem for fuzzy module
In this article we introduce $mu$-filtered fuzzy module with a family of fuzzy submodules. It shows the relation between $mu$-filtered fuzzy modules and crisp filtered modules by level sets. We investigate fuzzy topology on the $mu$-filtered fuzzy module and apply that to introduce fuzzy completion. Finally we extend Krull's intersection theorem of fuzzy ideals by using concept $mu$-adic comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1981
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(81)80003-0